Crate rctree

rctree is a "DOM-like" tree implemented using reference counting.

"DOM-like" here means that data structures can be used to represent the parsed content of an HTML or XML document, like the DOM does, but don't necessarily have the exact same API as the DOM. That is:

• A tree is made up of nodes.
• Each node has zero or more child nodes, which are ordered.
• Each node has a no more than one parent, the node that it is a child of.
• A node without a parent is called a root.
• As a consequence, each node may also have siblings: its parent's other children, if any.
• From any given node, access to its parent, previous sibling, next sibling, first child, and last child (if any) can take no more than O(1) time.
• Each node also has data associated to it, which for the purpose of this project is purely generic. For an HTML document, the data would be either the text of a text node, or the name and attributes of an element node.
• The tree is mutable: nodes (with their sub-trees) can be inserted or removed anywhere in the tree.

The lifetime of nodes is managed through reference counting. To avoid reference cycles which would cause memory leaks, the tree is asymmetric: each node holds optional strong references to its next sibling and first child, but only optional weak references to its parent, previous sibling, and last child.

Nodes are destroyed as soon as there is no strong reference left to them. The structure is such that holding a reference to the root is sufficient to keep the entire tree alive. However, if for example the only reference that exists from outside the tree is one that you use to traverse it, you will not be able to go back "up" the tree to ancestors and previous siblings after going "down", as those nodes will have been destroyed.

Weak references to destroyed nodes are treated as if they were not set at all. (E.g. a node can become a root when its parent is destroyed.)

Since nodes are aliased (have multiple references to them), RefCell is used for interior mutability.

Advantages:

• A single Node user-visible type to manipulate the tree, with methods.
• Memory is freed as soon as it becomes unused (if parts of the tree are removed).

Disadvantages:

• The tree can only be accessed from the thread is was created in.
• Any tree manipulation, including read-only traversals, requires incrementing and decrementing reference counts, which causes run-time overhead.
• Nodes are allocated individually, which may cause memory fragmentation and hurt performance.

Modules

iterator

Iterators prelude.

Structs

Ancestors	An iterator of nodes to the ancestors a given node.
Children	A double ended iterator of nodes to the children of a given node.
Descendants	An iterator of nodes to a given node and its descendants, in tree order.
FollowingSiblings	An iterator of nodes to the siblings after a given node.
Node	A reference to a node holding a value of type T. Nodes form a tree.
PrecedingSiblings	An iterator of nodes to the siblings before a given node.
Traverse	A double ended iterator of nodes to a given node and its descendants, in tree order.
WeakNode	A weak reference to a node holding a value of type T.

Enums

NodeEdge

A node type during traverse.